Means-Ends Analysis

Problem

Differences in State Spaces

Using differences in state spaces to take least difference path from initial to goal state. This is similar to path finding algorithm.

First move

There are 3 possible first moves resulting in 3 states out of which we could choose least one (if same, how to choose one would be dealt later).

Result

Block Problem V

This is because, all possible states have differences higher than what we currently have, so there is no reduction of differences.

MEA may get stuck in loop or getting away from goal like above. Also does not guarantee solution optimality also so costlier.

Problem Reduction

Reduce into sub goals. From above state we could pick on sub goal as C on D, but why that? Why not others? We as human could already deduce that, because that is what is missing , but from program perspective, how to pick up one of many sub goals to start, would be dealt later.

Applying to Raven's Matrices

Note that, KR has been used to identify what to move or operate upon. And then we could use G&T, MEA, PR combinations to solve the problem.